Computation and Universality: Class IV versus Class III Cellular Automata
نویسندگان
چکیده
1Departamento de Ciencias e Ingenierı́a de la Computación, Escuela Superior de Cómputo, Instituto Politécnico Nacional, México, Unconventional Computing Center, Bristol Institute of Technology, University of the West of England, Bristol, United Kingdom E-mail: [email protected] 2Área Académica de Ingenierı́a, Universidad Autónoma del Estado de Hidalgo, México E-mail: [email protected] 3Department of Computer Science/Kroto Research Institute, University of Sheffield, United Kingdom E-mail: [email protected]
منابع مشابه
Wolfram's Classification and Computation in Cellular Automata Classes III and IV
We conduct a brief survey on Wolfram’s classification, in particular related to the computing capabilities of Cellular Automata (CA) in Wolfram’s classes III and IV. We formulate and shed light on the question of whether Class III systems are capable of Turing universality or may turn out to be “too hot” in practice to be controlled and programmed. We show that systems in Class III are indeed c...
متن کاملUniversality and Complexity in Cellular Automata
Cellular automata are discrete dynamical systems with simple construction but complex self-organizing behaviour. Evidence is presented that all one-dimensional cellular automata fall into four distinct universality classes. Characterizations of the structures generated in these classes are discussed. Three classes exhibit behaviour analogous to limit points, limit cycles and chaotic attractors....
متن کاملDirected Percolation arising in Stochastic Cellular Automata
Cellular automata are both seen as a model of computation and as tools to model real life systems. Historically they were studied under synchronous dynamics where all the cells of the system are updated at each time step. Meanwhile the question of probabilistic dynamics emerges: on the one hand, to develop cellular automata which are capable of reliable computation even when some random errors ...
متن کاملComplexity Classes in the Two-dimensional Life Cellular Automata Subspace
Cellular automata (CA) are a class of discrete dynamical models which represent an approximation to physical systems composed of a large number of simple and locally interacting elements [18]. They have caught the interest of many researchers because of their rich and diverse phenomenology [16]. In this framework, Wolfram has shown that CA exhibit the full spectrum of dynamical behaviors [19] a...
متن کاملUniversality Class of Probabilistic Cellular Automata
The Ising-like phase transition is considered in probabilistic cellular automata (CA). The nonequilibrium CA with Toom rule are compared to standard equilibrium lattice systems to verify influence of synchronous vs asynchronous updating. It was observed by Marcq et al. [Phys.Rev.E 55(1997) 2606] that the mode of updating separates systems of coupled map lattices into two distinct universality c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Cellular Automata
دوره 7 شماره
صفحات -
تاریخ انتشار 2012